Graph Theory of Tower Tasks
نویسنده
چکیده
The appropriate mathematical model for the problem space of tower transformation tasks is the state graph representing positions of discs or balls and their moves. Graph theoretical quantities like distance, eccentricities or degrees of vertices and symmetries of graphs support the choice of problems, the selection of tasks and the analysis of performance of subjects whose solution paths can be projected onto the graph. The mathematical model is also at the base of a computerized test tool to administer various types of tower tasks.
منابع مشابه
Identification and assessment of human errors among tower crane operators using SHERPA and CREAM techniques
Introduction: Cranes are of the major causes of accidents in the construction industries. As human error mostly causes crane accidents, this study aims to investigate the human errors of tower crane operators in the construction projects using SHERPA and CREAM techniques. Material and Method: In this research, first, all of the tasks of the tower crane operator were identified and analyzed. Th...
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملTwo Constructions for Tower-Type Lower Bounds of Szemerédi’s Regularity Lemma
The theory of random graph is one of the most important theories in modern combinatorics and theoretical computer science. This naturally leads to the following question: what is the essential property of a random graph? How can we distinguish a given graph from a random graphs? This leads to the development of pseudo-random graph theory (quasi-random graphs). [2] gives a complete survey on pse...
متن کاملGeneralized Sierpiński graphs
Sierpiński graphs, S(n, k), were defined originally in 1997 by Klavžar and Milutinović. The graph S(1, k) is simply the complete graph Kk and S(n, 3) are the graphs of Tower of Hanoi problem. We generalize the notion of Sierpiński graphs, replacing the complete graph appearing in the case S(1, k) with any graph. The newly introduced notion of generalized Sierpiński graphs can be seen as a crite...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره 25 شماره
صفحات -
تاریخ انتشار 2012